SQUEEZE: Fast and Progressive Decompression of Triangle Meshes
نویسندگان
چکیده
An ideal triangle mesh compression technology would simultaneously support the following three objectives: (1) progressive refinements of the received mesh during decompression, (2) nearly optimal compression ratios for both geometry and connectivity, and (3) in-line, real-time decompression algorithms for hardware or software implementations. Because these three objectives impose contradictory constraints, previously reported efforts focus primarily on one – sometimes two – of these objectives. The SQUEEZE technique introduced here addresses all three constraints simultaneously, and attempts to provide the best possible compromise. For a mesh of T triangles, SQUEEZE compresses the connectivity to 3.7T bits, which is competitive with the best progressive compression techniques reported so far. The geometry prediction error encoding technique introduced here leads to 20% improved geometry compression over previous schemes. Our initial implementation on a 300 Mhz CPU achieves a decompression rate of up to 46’000 triangles per second. SQUEEZE downloads a model through a number of successive refinement stages, providing the benefit of progressivity.
منابع مشابه
Fast Multiresolution Mesh Decompression
Compression techniques for triangle-mesh representations of 3D models have been the focus of many recent efforts from the graphics, modeling, and theory research community; from developers of computer graphics hardware and software; and from organizations that define international standards. An ideal compression technology would simultaneously support the following three objectives: (1) progres...
متن کاملPOMAR: Compression of progressive oriented meshes accessible randomly
This paper presents a new random accessible and progressive lossless manifold triangle mesh compression algorithm named POMAR. It allows to extract different parts of the input mesh at different levels of detail during the decompression. A smooth transition without artefacts is generated between adjacent regions decompressed at different levels of detail. Our approach allows selective decompres...
متن کاملEdgebreaker: Connectivity Compression for Triangle Meshes
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of three-dimensional triangle meshes. Edgebreaker improves upon the storage required by previously reported schemes, most of which can guarantee only an O(tlog(t)) storage cost for the incidence graph of a mesh of t triangles. Edgebreaker requires at most 2t bits for a...
متن کاملDynamic Progressive Triangle-Quadrilateral Meshes
We present an extension of the original progressive mesh algorithm for large dynamic meshes that contain a mix of triangle and quadrilateral elements. The demand for this extension comes from the visualisation of dynamic finite element simulations, such as car crashes or metal sheet punch operations. These methods use meshes, which consist mainly of quadrilaterals, due to their increased numeri...
متن کاملWrap&Zip decompression
The Edgebreaker compression [16, 11] is guaranteed to encode any unlabeled triangulated planar graph of t triangles with at most 1.84t bits. It stores the graph as a CLERS stringa sequence of t symbols from the set {C,L,E,R,S}, each represented by a 1, 2 or 3 bit code. We show here that, in practice, the string can be further compressed to between 0.91t and 1.26t bits using an entropy code. Th...
متن کامل